| partial class SET_INCL{E} < $SET{E} |
|---|
| **** | SET_INCL defines some of the set functions which are not dependant on the implementation of the set. The most common routines (union, intersect etc.) are special cased so that when the argument is of type SAME there is no dispatching. Be careful about create |
| $SET{_} | $RO_SET{_} | $STR | $CONTAINER{_} | $ELT{_} | $ELT | RO_SET_INCL{_} | COMPARE{_} |
| H_SET{_} | SET{_} |
| clear |
|---|
| **** | Expensive! To make sure that we don't overwrite while reading, use a seperate array. |
| copy_from(a: $ELT{E}) |
|---|
| **** | Clear old elts and insert the elements of self |
| create(a: ARRAY{E}): SAME |
|---|
| stub create: SAME; |
|---|
| **** | Create an empty set - used by the other set create routines |
| create_from(e: $ELT{E}): SAME |
|---|
| stub delete(e:E); |
|---|
| **** | Delete element "e" from the set |
| stub insert(e:E); |
|---|
| **** | Insert element "e" into the set |
| to_diff(a: $ELT{E}) |
|---|
| to_intersection(a: $ELT{E}) |
|---|
| to_sym_diff(a: $ELT{E}) |
|---|
| to_union(a: $ELT{E}) |
|---|